Contemporary aspects of car sequencing problem in a paint shop

The Binary Paint Shop Problem

We consider the binary paint shop problem (PPW(2,1)). We describe an approach to solve PPW(2,1). This approach is based on constructing a logical model for PPW(2,1). Mathematics Subject Classification: 68T20

Complexity results on a paint shop problem

Complexity Results for Restricted Instances of a Paint Shop Problem

We study the following problem: an instance is a word with every letter occurring twice. A solution is a 2-coloring of the letters in the word such that the two occurrences of every letter are colored with different colors. The goal is to minimize the number of color changes between adjacent letters. This is a special case of the Paint Shop Problem, which was previously shown to be NP-hard. We ...

MaxFlow-MinCut Duality for a Paint Shop Problem

Tabu Search for a Car Sequencing Problem

The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was proposed by the automobile manufacturer Renault. The first objective of the car industry is to assign a production day to each customer-ordered car and the second one consists of scheduling the order of cars to be put on the...